1715A - Crossmarket - CodeForces Solution

constructive algorithms greedy math

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n, m = map(int, input().split())
    if n == 1 and m == 1:
        print(0)
    else:
        print((n-1) + (m-1) + min(n,m))

C++ Code: 

    #include <iostream>
     
    using namespace std;
     
    signed main() {
        (*cin.tie(0)).sync_with_stdio(0);
        int t; cin >> t;
        while (t--) {
            int n, m; cin >> n >> m;
            cout << n + m + min(n, m) - 3 + min(max(n, m) - 1, 1) << "\n";
        }
        return 0;
    }


Comments

Submit
0 Comments
More Questions

1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold